ANOC: Anonymous Network-Coding-Based Communication with Efficient Cooperation
نویسندگان
چکیده
منابع مشابه
Energy Efficient Communication with Random Node Cooperation
In this chapter, we focus on the energy efficient cooperative communication with random node cooperation for wireless networks. By “random,” we mean that the cooperative nodes for each communication event are randomly selected based on the network and channel conditions. Different from the conventional deterministic cooperative communication where cooperative nodes are determined prior to the c...
متن کاملEffectiveness Analysis of ALNCode Scheme for Anonymous Communication with Network Coding
Network coding provides a new perspective for anonymous communication. Wang et al. propose an anonymous communication scheme named ALNCode, in which the linear relation of the global encoding vectors can be hidden without the participation of encryption/decryption operations. But the effectiveness of the scheme needs to be further analyzed. In this paper, we present an exact formula of the effe...
متن کاملA STor: Social Network based Anonymous Communication in Tor
Anonymity networks hide user identities with the help of relayed anonymity routers. However, the state-of-the-art anonymity networks do not provide an effective trust model. As a result, users cannot circumvent malicious or vulnerable routers, thus making them susceptible to malicious router based attacks (e.g., correlation attacks). In this paper, we propose a novel social network based trust ...
متن کاملSTor: Social Network based Anonymous Communication in Tor
Anonymity networks hide user identities with the help of relayed anonymity routers. However, the state-of-the-art anonymitynetworks do not provide an effective trust model. As a result, users cannot circumvent malicious or vulnerable routers, thus makingthem susceptible to malicious router based attacks (e.g., correlation attacks). In this paper, we propose a novel social network based<...
متن کاملAnonymous Coherent Network Coding Against Active Adversary
This paper considers a problem of anonymous transmission against eavesdropping and jamming in coherent network coding. A message of n packets is transmitted between some source-receiver pair. An adversary can eavesdrop arbitrary μ packets and inject no more then t malicious packets. The goal is to achieve a communication in such a manner that the adversary can not determine who communicates wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2012
ISSN: 0733-8716
DOI: 10.1109/jsac.2012.121018